APPROXIMATION BY SEVERAL RATIONALS
نویسندگان
چکیده
منابع مشابه
Approximation by Several Rationals
Following T. H. Chan, we consider the problem of approximation of a given rational fraction a/q by sums of several rational fractions a1/q1, . . . , an/qn with smaller denominators. We show that in the special cases of n = 3 and n = 4 and certain admissible ranges for the denominators q1, . . . , qn, one can improve a result of T. H. Chan by using a different approach. 2000 Mathematics Subject ...
متن کاملNumerical Chebyshev Approximation by Interpolating Rationals
The paper is concerned with the Chebyshev approximation of decay-type functions /(x) by interpolating rationals. The interpolating points are chosen to be the zeros of j(x). Existence, uniqueness and characterization of best approximations are first shown. An exchange algorithm is then described for computing the best approximation.
متن کاملThe Rate of Geodesic Cusp Excursions and Approximation by Rationals
We derive several results that describe the rate at which a generic geodesic makes excursions into and out of a cusp on a finite area hyperbolic surface and relate them to approximation with respect to the orbit of infinity for an associated Fuchsian group. This provides proofs of some well known theorems from metric diophantine approximation in the context of Fuchsian groups. It also gives new...
متن کاملOn the Approximation of Irrational Numbers with Rationals Restricted by Congruence Relations
Usually this theorem is proved by using continued fractions; see Theorem 193 in [2]. S. Hartman [3] has restricted the approximating numbers f to those fractions, where u and v belong to fixed residue classes a and b with respect to some modulus s. He proved the following: For any irrational number £, any s > 1, and integers a and b, there are infinitely many integers u and v > 0 satisfying 2s (1)
متن کاملApproximation of Automorphisms of the Rationals and the Random Graph
Let G be the group of order-preserving automorphisms of the rationals Q, or the group of colour-preserving automorphisms of the C-coloured random graph RC . We show that given any non-identity f ∈ G, there exists g ∈ G such that every automorphism in G is the limit of a sequence of automorphisms generated by f and g. Moreover, if, in some sense, f has no finite structure, then g can be chosen w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2008
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972708000373